A new three-term conjugate gradient method with application to regression analysis
نویسندگان
چکیده
Conjugate gradient (CG) method is well-known for its ability to solve unconstrained optimization (UO.) problems. This article presenting a new CG with sufficient descent conditions which improves the former developed by Rvaie, Mustafa, Ismail and Leong (RMIL). The efficacy of proposed has been demonstrated through simulations on Kijang Emas pricing regression problem. daily data between January 2021 May were obtained from Malaysian Ministry Health Bank Negara Malaysia. dependent variable this study was price, independent variables coronavirus disease (COVID-19) measures (i.e., cases, R-naught, death recovered). Data collected analyzed correlation coefficient determinant, influences COVID-19 price examined multiple linear model. Findings revealed that suggested technique outperformed existing algorithms in terms computing efficiency.
منابع مشابه
A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولA New Application of the Conjugate Gradient
In this paper, the conjugate gradient algorithm ((1]) is described and applied to the process of adaptive beamforming. This algorithm is a variation on the classical Fletcher-Reeves method, and it has a distinct advantage for real-time applications , since it has fast convergence properties, and requires no matrix inversions. This method is applied to a simple adaptive beamformer. Simulation re...
متن کاملSpectral method and its application to the conjugate gradient method
A new method used to prove the global convergence of the nonlinear conjugate gradient methods, the spectral method, is presented in this paper, and it is applied to a new conjugate gradient algorithm with sufficiently descent property. By analyzing the descent property, several concrete forms of this algorithm are suggested. Under standard Wolfe line searches, the global convergence of the new ...
متن کاملA Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
Conjugate gradient methods are widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we propose a general form of three-term conjugate gradient methods which always generate a sufficient descent direction. We give a sufficient condition for the global convergence of the proposed general method. Moreover, we pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Power Electronics and Drive Systems
سال: 2022
ISSN: ['2722-2578', '2722-256X']
DOI: https://doi.org/10.11591/ijece.v12i5.pp5248-5259